1047B - Cover Points - CodeForces Solution


geometry math *900

Please click on ads to support us..

Python Code:

a=[]

for i in range(int(input())):
	x, y=map(int,input().split())
	a.append(x+y)
    
print(max(a))
  							    		  	  				   		 	

C++ Code:

#include <bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define ll long long
const long long MOD = 1e9 + 7, OO = 1e18;
const double PI = acos(-1);
const int N = 1e5 + 5;
int main() {
    IO
    ll n,x,y,mx=0;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> x >> y;
        mx = max (mx,x+y);
    }
    cout << mx;
    
    
    
    return 0;
}


Comments

Submit
0 Comments
More Questions

1372B - Omkar and Last Class of Math
1025D - Recovering BST
439A - Devu the Singer and Churu the Joker
1323A - Even Subset Sum Problem
1095A - Repeating Cipher
630F - Selection of Personnel
630K - Indivisibility
20B - Equation
600B - Queries about less or equal elements
1015A - Points in Segments
1593B - Make it Divisible by 25
680C - Bear and Prime 100
1300A - Non-zero
1475E - Advertising Agency
1345B - Card Constructions
1077B - Disturbed People
653A - Bear and Three Balls
794A - Bank Robbery
157A - Game Outcome
3B - Lorry
1392A - Omkar and Password
489A - SwapSort
932A - Palindromic Supersequence
433A - Kitahara Haruki's Gift
672A - Summer Camp
1277A - Happy Birthday Polycarp
577A - Multiplication Table
817C - Really Big Numbers
1355A - Sequence with Digits
977B - Two-gram